Mechanizing a Process Algebra for Network Protocols
نویسندگان
چکیده
منابع مشابه
Showing Invariance Compositionally for a Process Algebra for Network Protocols
This paper presents the mechanization of a process algebra for Mobile Ad hoc Networks and Wireless Mesh Networks, and the development of a compositional framework for proving invariant properties. Mechanizing the core process algebra in Isabelle/HOL is relatively standard, but its layered structure necessitates special treatment. The control states of reactive processes, such as nodes in a netw...
متن کاملUsing Process Algebra to Design Better Protocols
Protocols are mainly specified in natural languages, such as English, without presenting a formal specification or some sort of pseudo code. At first glance this seems to be an advantage: everybody can easily read and understand the specification, and hence, the protocol is easy to implement. However, looking at contemporary protocol developments more closely, it turns out that natural language...
متن کاملMechanizing Game-Based Proofs of Security Protocols
After a short introduction to the field of security protocol verification, we present the automatic protocol verifier CryptoVerif. In contrast to most previous protocol verifiers, CryptoVerif does not rely on the Dolev-Yao model, but on the computational model. It produces proofs presented as sequences of games, like those manually done by cryptographers; these games are formalized in a probabi...
متن کاملA Process Algebra for Synchronous
Concurrent constraint programming is classically based on asynchronous communication via a shared store. Synchrony can be achieved by forcing concurrently running ask and tell primitives to synchronise on \new common information". This paper outlines this framework, called Scc, and develops an algebraic semantics for it. The Scc framework is shown to share similarities with both the traditional...
متن کاملA Process Algebra for Games
Using formal tools in computer science to describe games is an interesting problem. We give games, exactly two person games, an axiomatic foundation based on the process algebra ACP (Algebra of Communicating Process). A fresh operator called opponent’s alternative composition operator (OA) is introduced into ACP to describe game trees and game strategies, called GameACP. And its sound and compl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 2016
ISSN: 0168-7433,1573-0670
DOI: 10.1007/s10817-015-9358-9